Surface inpainting with sparsity constraints
نویسندگان
چکیده
منابع مشابه
Surface inpainting with sparsity constraints
In this paper we devise a new algorithm for completing surface with missing geometry and topology founded upon the theory and techniques of sparse signal recovery. The key intuition is that any meaningful 3D shape, represented as a discrete mesh, almost certainly possesses a low-dimensional intrinsic structure, which can be expressed as a sparse representation in some transformed domains. Inste...
متن کاملAudio Inpainting with Social Sparsity
Kai Siedenburg Schulich School of Music McGill University Montreal, Canada Email: [email protected] Monika Dörfler Numerical Harmonic Analysis Group Faculty of Mathematics, Univ. of Vienna Wien, Austria Email: [email protected] Matthieu Kowalski Laboratoire des Signaux et Systèmes UMR 8506 CNRS -SUPELECUniv. Paris-Sud Gif-sur-Yvette, France Email: [email protected]...
متن کاملBandlet-based sparsity regularization in video inpainting
We present a bandlet-based framework for video inpainting in order to complete missing parts of a video sequence. The framework applies spatio-temporal geometric flows extracted by bandlets to reconstruct the missing data. First, a priority-based exemplar scheme enhanced by a bandlet-based patch fusion generates a preliminary inpainting result. Then, the inpainting task is completed by a 3D vol...
متن کاملTrading Accuracy for Sparsity in Optimization Problems with Sparsity Constraints
We study the problem of minimizing the expected loss of a linear predictor while constraining its sparsity, i.e., bounding the number of features used by the predictor. While the resulting optimization problem is generally NP-hard, several approximation algorithms are considered. We analyze the performance of these algorithms, focusing on the characterization of the trade-off between accuracy a...
متن کاملOnline Linear Optimization with Sparsity Constraints
We study the problem of online linear optimization with sparsity constraints in the 1 semi-bandit setting. It can be seen as a marriage between two well-known problems: 2 the online linear optimization problem and the combinatorial bandit problem. For 3 this problem, we provide two algorithms which are efficient and achieve sublinear 4 regret bounds. Moreover, we extend our results to two gener...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Aided Geometric Design
سال: 2016
ISSN: 0167-8396
DOI: 10.1016/j.cagd.2015.10.003